Transitive Permutation Groups with Non-self-paired Suborbits of Length 2 and Their Graphs
نویسندگان
چکیده
Transitive permutation groups having a non self paired suborbit of length are investigated via the corresponding orbital graphs If G is such a group and X is the orbital graph associated with a sub orbit of length of G which is not self paired then X has valency and admits a vertex and edge but not arc transitive action of G There is a natural balanced orientation of the edge set of X induced and preserved by G An analysis of the properties of this oriented graph is performed using a variety of graph theoretic tools resulting in some partial results on the point stabilizer of G in the case when X is connected In particular the point stabilizer must be a group generated by h involutions Moreover a characterization of the groups G is obtained in the case of point stabilizers of order and in the case of abelian point stabilizers Finally a graphical realization of such actions is given that is an in nite family of tetravalent graphs admitting a vertex and edge but not arc transitive action with vertex stabilizers Z h h as well as an in nite family of such graphs with vertex stabilizer D the dihedral group of order is constructed
منابع مشابه
On the Point Stabilizers of Transitive Groups with Non-self-paired Suborbits of Length
In [7] a characterization of transitive permutation groups having a non-self-paired suborbit of length 2 (with respect to which the corresponding orbital graph is connected) was obtained in terms of their point stabilizers. As a consequence, elementary abelian groups were proved to be the only possible abelian point stabilizers arising from such actions, and D8 was shown to be the only nonabeli...
متن کاملSemisymmetry of Generalized Folkman Graphs
A regular edge but not vertex transitive graph is said to be semisym metric The study of semisymmetric graphs was initiated by Folkman who among others gave constructions of several in nite families such graphs In this paper a generalization of his construction for or ders a multiple of is proposed giving rise to some new families of semisymmetric graphs In particular one associated with the cy...
متن کاملAn O'nan-scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-arc Transitive Graphs
A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'NanScott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The str...
متن کاملNormal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کامل